A simplified correctness proof for a well-known algorithm computing strongly connected components
نویسنده
چکیده
The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Linear-time algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented.
منابع مشابه
Depth-first search and strong connectivity in Coq
Using Coq, we mechanize Wegener’s proof of Kosaraju’s linear-time algorithm for computing the strongly connected components of a directed graph. Furthermore, also in Coq, we define an executable and terminating depth-first search algorithm.
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملA New Proof for the Correctness of F5 (F5-Like) Algorithm
The famous F5 algorithm for computing Gröbner basis was presented by Faugère in 2002 without complete proofs for its correctness. The current authors have simplified the original F5 algorithm into an F5 algorithm in Buchberger’s style (F5B algorithm), which is equivalent to original F5 algorithm and may deduce some F5-like versions. In this paper, the F5B algorithm is briefly revisited and a ne...
متن کاملA Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication
Fingerprinting is a well known technique, which is often used in designing Monte Carlo algorithms for verifying identities involving matrices, integers and polynomials. The book by Motwani and Raghavan [1] shows how this technique can be applied to check the correctness of matrix multiplication – check if AB = C where A,B and C are three n×n matrices. The result is a Monte Carlo algorithm runni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 83 شماره
صفحات -
تاریخ انتشار 2002